Worst-case optimal control over a finite horizon
نویسندگان
چکیده
منابع مشابه
Optimal Control of Nonlinear Uncertain Systems over an Infinite Horizon via Finite-Horizon Approximations
It is well-known that the Hamilton-Jacobi-Isaacs (HJI) equation associated with a nonlinear H-optimal control problem on an infinite-time horizon generally admits nonunique, and in fact infinitely many, viscosity solutions. This makes it difficult to pick the relevant viscosity solution for the problem at hand, particularly when it is computed numerically. For the finitehorizon version of the p...
متن کاملOptimal Control of Partiality Observable Markov Processes over a Finite Horizon
This report presents an approach to find exact solution of optimal control of POMDPs (Partiality Observable Markov Decision Process) over a finite horizon under having a few reasonable assumptions. The approach only considers finite-state Markov processes. By comparing MDPs and PODMPs from optimal control policies point of view, it will be demonstrated that solving POMDPs is harder than solving...
متن کاملNear optimal control of queueing networks over a finite time horizon
We propose a method for the control of multi-class queueing networks over a finite time horizon. We approximate the multi-class queueing network by a fluid network and formulate a fluid optimization problem which we solve as a separated continuous linear program. The optimal fluid solution partitions the time horizon to intervals in which constant fluid flow rates are maintained. We then use a ...
متن کاملA Finite Horizon Optimal Multiple Switching Problem
We consider the problem of optimal multiple switching in finite horizon, when the state of the system, including the switching costs, is a general adapted stochastic process. The problem is formulated as an extended impulse control problem and completely solved using probabilistic tools such as the Snell envelop of processes and reflected backward stochastic differential equations. Finally, whe...
متن کاملWorst-case optimal algorithm for XPath evaluation over XML streams
We consider the XPath evaluation problem: Evaluate an XPath query Q on a streaming XML documentD; i.e., determine the setQ(D) of document elements selected byQ. We mainly consider Conjunctive XPath queries that involve only the child and descendant axes. Previously known in-memory algorithms for this problem use O(|D|) space and O(|Q||D|) time. Several previously known algorithms for the stream...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1992
ISSN: 0022-247X
DOI: 10.1016/0022-247x(92)90357-j